Variable Compression in ProbLog

نویسندگان

  • Theofrastos Mantadelis
  • Gerda Janssens
چکیده

The paper identifies patterns of Boolean variables that occur in Boolean formulae, namely AND-clusters and OR-clusters. We give a polynomial algorithm that detects AND-clusters in disjunctive normal form (DNF) Boolean formulae, or OR-clusters in conjunctive normal form (CNF) Boolean formulae. Furthermore, we explain how to exploit the clusters in the context of ProbLog. In ProbLog, Boolean formulae are used to express how the probability of a query depends on the probabilistic part of a ProbLog program. Boolean formulae in ProbLog are represented by Reduced Ordered Binary Decision Diagrams (ROBDD). Depending on the Boolean formula, the generation of a ROBDD can be very costly. In this paper we present how to compress clusters in Boolean formulae and make the generation of the ROBDD more efficient without affecting the probability of the query. We did an experimental evaluation of the effects of AND-cluster compression for a real application of ProbLog. With our prototype implementation we have a significant improvement in performance (up to 87%) for the generation of ROBDDs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling of Compression Curves of Flexible Polyurethane Foam with Variable Density, Chemical Formulations and Strain Rates

Flexible Polyurethane (PU) foam samples with different densities and chemical formulations were tested in quasi-static stress-strain compression tests. The compression tests were performed using the Lloyd LR5K Plus instrument at fixed compression strain rate of 0.033 s-1 and samples were compressed up to 70% compression strains. All foam samples were tested in the foam rise direction and their ...

متن کامل

On the Efficient Execution of ProbLog Programs

The past few years have seen a surge of interest in the field of probabilistic logic learning or statistical relational learning. In this endeavor, many probabilistic logics have been developed. ProbLog is a recent probabilistic extension of Prolog motivated by the mining of large biological networks. In ProbLog, facts can be labeled with mutually independent probabilities that they belong to a...

متن کامل

On Continuous Distributions and Parameter Estima- tion in Probabilistic Logic Programs

In the last decade remarkable progress has been made on combining statistical machine learning techniques, reasoning under uncertainty, and relational representations. The branch of Artificial Intelligence working on the synthesis of these three areas is known as statistical relational learning or probabilistic logic learning. ProbLog, one of the probabilistic frameworks developed, is an extens...

متن کامل

Dedicated Tabling for a Probabilistic Setting

ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a sum of products. ProbLog applies advanced techniques to make this feasible and to assess the correct probability. Tabling is a well-known technique to avoid repeated subcomputations and to terminate loops. We investi...

متن کامل

Nesting Probabilistic Inference

When doing inference in ProbLog, a probabilistic extension of Prolog, we extend SLD resolution with some additional bookkeeping. This additional information is used to compute the probabilistic results for a probabilistic query. In Prolog’s SLD, goals are nested very naturally. In ProbLog’s SLD, nesting probabilistic queries interferes with the probabilistic bookkeeping. In order to support nes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010